Worst-case optimal insertion and deletion methods for decomposable searching problems
نویسندگان
چکیده
منابع مشابه
Decomposable Searching Problems
In this paper we will investigate transformations that serve as tools in the design of new data structures. Specifically, we study general methods for converting static structures (in which all elements are known before any searches are performed) to dynamic structures (in which insertions of new elements can be mixed with searches). We will exhibit three classes of such transformations, each b...
متن کاملDynamization of Decomposable Searching Problems
In the complexity theory of geometric configurations (and other areas of algorithmic endeavor) one encounters a fair number of problems for which a very efficient static solution is known, but no alternative to complete reconstruction seems to come to mind when we wish to insert or delete even a single point. Bentley [1 3 recognized a large class of problems (which he called decomposable search...
متن کاملWorst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems
Worst-case optimal join algorithms are the class of join algorithms whose runtime match the worst-case output size of a given join query. While the first provably worse-case optimal join algorithm was discovered relatively recently, the techniques and results surrounding these algorithms grow out of decades of research from a wide range of areas, intimately connecting graph theory, algorithms, ...
متن کاملOptimal codes in deletion and insertion metric
We improve the upper bound of Levenshtein for the cardinality of a code of length 4 capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we will construct an optimal perfect code capable of correcting single deletions for the same parameters.
متن کاملWorst - Case - Optimal Anytime
Coalition formation is one of the key problems in mul-tiagent systems. One would prefer a coalition structure that maximizes the sum of the values of the coalitions , but often the number of coalition structures is too large to allow exhaustive search for the optimal one. This paper focuses on nding a worst case bound on how good the optimal coalition structure is compared to the best coalition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1981
ISSN: 0020-0190
DOI: 10.1016/0020-0190(81)90093-4